Iso-array rewriting P systems with context-free iso-array rules
نویسندگان
چکیده
منابع مشابه
Parallel Array-rewriting P Systems
A variant of array-rewriting P systems that uses parallel rewriting of arrays in the regions is introduced. The generative power of this model is compared with certain array grammars generating array languages. It is shown that geometric arrays such as hollow rectangles and hollow squares can be generated by parallel array P systems with a priority relation on the rules. The advantage of the pr...
متن کاملOne-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for P systems with (one-dimensional) insertion rules is undecidable. Then we show computational completeness of P systems using (one-dimensional) array insertion...
متن کاملP systems generating iso-picture languages
P systems generating rectangular arrays and hexagonal arrays have been studied in the literature, bringing together the two areas of theoretical computer science, namely membrane computing and picture languages. Recently, a new class of picture languages called the class of iso-picture languages generating interesting picture languages has been introduced. In this paper, we develop a class of t...
متن کاملOn Parallel Array P Systems
We further investigate the parallel array P systems recently introduced by K.G. Subramanian, P. Isawasan, I. Venkat, and L. Pan. We first make explicit several classes of parallel array P systems (with one or more axioms, with total or maximal parallelism, with rules of various types). In this context, some results from the above mentioned paper by Subramanian et al. are improved. A series of o...
متن کاملParsing Linear Context-Free Rewriting Systems
We describe four different parsing algorithms for Linear Context-Free Rewriting Systems (Vijay-Shanker et al., 1987). The algorithms are described as deduction systems, and possible optimizations are discussed. The only parsing algorithms presented for linear contextfree rewriting systems (LCFRS; Vijay-Shanker et al., 1987) and the equivalent formalism multiple context-free grammar (MCFG; Seki ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICS FOR APPLICATIONS
سال: 2014
ISSN: 1805-3610,1805-3629
DOI: 10.13164/ma.2014.01